Approximate solution of NP optimization problems
نویسندگان
چکیده
منابع مشابه
Approximate Solution of NP Optimization Problems
This paper presents the main results obtained in the field of approximation algorithms in a unified framework. Most of these results have been revisited in order to emphasize two basic tools useful for characterizing approximation classes, that is, combinatorial properties of problems and approximation preserving reducibilities. In particular, after reviewing the most important combinatorial ch...
متن کاملOptimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
In optimization engineering, the engineer might have different approaches to solve a problem and he/she asks himself/herself, " Which is the best exact approach for finding the optimal solution? " The best results are often obtained by using hybrid algorithms, i.e., by combining different approaches because the most effective algorithm to be used for finding the optimal solution of a given prob...
متن کاملOptical solution for bounded NP-complete problems.
We present a new optical method for solving bounded (input-length-restricted) NP-complete combinatorial problems. We have chosen to demonstrate the method with an NP-complete problem called the traveling salesman problem (TSP). The power of optics in this method is realized by using a fast matrix-vector multiplication between a binary matrix, representing all feasible TSP tours, and a gray-scal...
متن کاملLogical Definability of NP Optimization Problems
We investigate here NP optimization problems from a logical deenability standpoint. We show that the class of optimization problems whose optimum is deenable using rst-order formulae coincides with the class of polynomially bounded NP optimization problems on nite structures. After this, we analyze the relative expressive power of various classes of optimization problems that arise in this fram...
متن کاملA compendium of NP optimization problems
Introduction 0.1 This is a continuously updated catalog of approximability results for NP optimization problems. The compendium will be printed as an appendix of the book Ausiello et al., 1998 that will be published in the end of 1998 or beginning of 1999. You can use WWW forms to report new problems, new results on existing problems or errors. Due to the fact that no NP-complete problem can be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1995
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)00291-p